//输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。 
//
// 
//
// 示例 1： 
//
// 输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 限制： 
//
// 
// 0 <= matrix.length <= 100 
// 0 <= matrix[i].length <= 100 
// 
//
// 注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/ 
// Related Topics 数组 
// 👍 132 👎 0


package com.yun.leetcode.editor.cn;

import java.util.Arrays;

public class ShunShiZhenDaYinJuZhenLcof {
    public static void main(String[] args) {
        Solution solution = new ShunShiZhenDaYinJuZhenLcof().new Solution();
        int[][] ary = new int[][]{};
        System.out.println(Arrays.toString(solution.spiralOrder(ary)));
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int[] spiralOrder(int[][] matrix) {
            // 顺时针打印矩阵
            int m = matrix.length;
            if (m == 0) {
                return new int[0];
            }
            int n = matrix[0].length;
            int[] result = new int[m * n];
            int x = 0;
            int y = 0;
            int curIndex = 0;
            int direct = 1;
            int circle = 0;
            while (curIndex < m * n) {
                result[curIndex++] = matrix[x][y];
                if (direct == 1) {
                    if (y < n - 1 - circle) {
                        y++;
                    } else {
                        direct = 2;
                        x++;
                    }
                } else if (direct == 2) {
                    if (x < m - 1 - circle) {
                        x++;
                    } else {
                        direct = 3;
                        y--;
                    }
                } else if (direct == 3) {
                    if (y > circle) {
                        y--;
                    } else {
                        direct = 4;
                        x--;
                    }
                } else {
                    // direct = 4;
                    if (x > circle + 1) {
                        x--;
                    } else {
                        circle++; // 圈数+1
                        y++;
                        direct = 1;
                    }
                }

            }

            return result;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}